Allocation of Real-Time Computations under Fault Tolerance Constraints

نویسندگان

  • Shem-Tov Levi
  • Daniel Mossé
  • Ashok K. Agrawala
چکیده

Allocation of resources in \next-generation" real-time operating systems requires some important features in addition to those demonstrated by current systems, resulting in an increased complexity of each system. The allocation is closely related to the scheduling, and the two are based on time considerations, rather then on a static priority scheme. The allocation is fault tolerance motivated, to cope with the application's reliability goals. Distributed system issues and adaptive behavior requirements increase the complexity and signi cance of the allocation approach. The allocation scheme we propose here accomplishes the hard real-time goal of guaranteeing a deadline satisfaction in case the job is accepted. In addition, this allocation scheme supports fault tolerance objectives in both damage containment and resiliency requirements. It does this in cooperation with a schedulability veri cation mechanism, and with an object architecture in which for each object there exists a calendar that maintains the time of its execution. A nice feature of this scheme is the way in which it can be used for reallocation while increasing the resiliency.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Guaranteeing Fault Tolerance through Scheduling on a CAN bus

Prioritizing tasks in Hard-Real-Time Systems is a problem belonging to NP-hard class. Scheduling and resource allocation in real-time systems are difficult problems due to the timing constraints of the tasks involved. Scheduling policies in hard real-time systems need to ensure that tasks will meet their deadlines under all circumstances, even in the presence of faults. This work presents techn...

متن کامل

Research Planning Course Final Report

Real-time systems typically have to satisfy complex requirements mapped to the timing attributes of the tasks that are eventually guaranteed by the underlying scheduler. These systems consist of a mix of hard and soft tasks with varying criticality as well as associated fault tolerance (FT) requirements. Often time redundancy techniques are preferred in many embedded applications and hence it i...

متن کامل

Replication and Resubmission Based Adaptive Decision for Fault Tolerance in Real Time Cloud Computing: A New Approach

Cloud computing an adoptable technology is the upshot evolution of on demand service in the computing epitome of immense scale distributed computing. With the raising asks and welfares of cloud computing infrastructure, society can take leverage of intensive computing capability services and scalable, virtualized vicinity of cloud computing to carry out real time tasks executed on a remote clou...

متن کامل

An Operational Approach to Budget-constrained Reliability Allocation

In this paper the problem of maximal increase of system reliability is formulated as a resource allocation problem under a budget constraint. Dynamic programing is used for the optimal solution. Time to system failure is dictated by a Markov process. The system is composed of several subsystems. Each subsystem has several possible configurations that exhibit different levels of fault tolerance ...

متن کامل

On the Impact of Fault-Tolerance Mechanisms in a Peer-to-Peer Middleware

We address the problem of integrating real-time fault-tolerance mechanisms into peer-to-peer systems, with specific architecture and deployment constraints. For this purpose we implemented a prototype hierarchical peer-to-peer framework in which the leaf peers are sensors that generate different kinds of traffic such as mesh management, events, video and audio. We evaluate the framework by meas...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1988